Description: 这里给大家提供一个用C语言做的小系统__停车场管理系统和有关Josephus问题的解决,是关于数据结构.-here to provide you with a C language system __ small carpark management system and the Josephus resolve the problem of data structure. Platform: |
Size: 3072 |
Author: 阁元成 |
Hits:
Description: 约瑟夫环问题。从这个程序可以学习到结构体的应用及指针的应用，当然还有算法了-Josephus problem. This procedure can learn the structure of the application and the target application and, of course, the algorithm Platform: |
Size: 1024 |
Author:hxj1984 |
Hits:
Description: 用循环链表求解约瑟夫(josephus)问题
求解约瑟夫(josephus)问题,用数组实现-cyclic Chain Solution Joseph (josephus) problem solving Joseph (josephus ), using the array to achieve Platform: |
Size: 8192 |
Author:zy |
Hits:
Description: 约瑟夫生死者问题的c++实现。建立了处理问题的模板。-Joseph s life and death issue c++ Achieve. Set up templates to deal with the problem. Platform: |
Size: 238592 |
Author:桂正科 |
Hits:
Description: Josephus的实验,用C语言解决这个问题,内含C语言全码-Josephus experiments, using C language to solve this problem, including the entire C language code Platform: |
Size: 8192 |
Author:陈陈 |
Hits:
Description: 成功的解决了约瑟夫问题，对于学习了解约瑟夫问题的程序员很有帮助！-Joseph successfully solved the problem, for students learning to understand the issues programmers Joseph helpful! Platform: |
Size: 1024 |
Author:yedaixiong |
Hits:
Description: 约瑟夫问题C++求解 以及KMP算法的C++实现-Joseph C++ problem solving as well as the KMP algorithm for C++ implementation Platform: |
Size: 1024 |
Author:gaef |
Hits:
Description: 编写一个求解Josephus问题的函数。用整数序列1, 2, 3, ……, n表示顺序围坐在圆桌周围的人。然后使用n = 9, s = 1, m = 5，以及n = 9, s = 1, m = 0，或者n = 9, s = 1, m = 10作为输入数据，检查你的程序的正 确性和健壮性。最后分析所完成算法的时间复杂度。定义JosephusCircle类，其中含完成初始化、报数出圈成 员函数、输出显示等方法。-Josephus write a problem solving function. With the sequence of integers 1, 2, 3, ... ..., n the order of sitting around the round table, said the people around. And then use n = 9, s = 1, m = 5, and n = 9, s = 1, m = 0, or n = 9, s = 1, m = 10 as input data, check the correctness of your program and robustness. Completed the final analysis, the algorithm' s time complexity. Definition JosephusCircle class, which included the completion of initialization, reported that the number of member functions of a circle, the output display and other methods. Platform: |
Size: 1024 |
Author:王宗亮 |
Hits:
Description: 2． 用循环链表解Josephus问题。设有n个人围坐在一个圆桌周围，现从第1个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n和m，求出按出列次序得到的n个人员的序列-2. Josephus solution of the problem with the circulation list. With n individuals sitting around a round table is started by a report from the first number, the number of people out to the first m columns, and then from the next person out of the column began to count off again, several to the first m out of those people who have column, ..., and so forth until all of the columns were all out of date. Josephus The question is: For any given n and m, find out the columns according to the order received sequence of n-persons Platform: |
Size: 1024 |
Author:sprite |
Hits:
Description: C语言实现的约瑟夫环问题，该问题的另一个名字叫做猴子选老大。-C language implementation of the Joseph cycle problem, the problem is another name is Hou Zi election boss. Platform: |
Size: 2048 |
Author:hankun |
Hits:
Description: 使用顺序存储的线性表解决约瑟夫（Josephus）问题-Use the table to solve the linear sequence of storage, Joseph (Josephus) problem Platform: |
Size: 2048 |
Author:安全卫士 |
Hits:
Description: 自己编写的Josephus问题的求解方法，用C语言采用数组方式实现，个人认为比教科书上提供的方法要精简的多，和大家一起分享-I have written Josephus problem solving method, using C language using an array of ways to achieve, personally think that way than the provision of textbooks to be streamlined and more to share with everyone Platform: |
Size: 887808 |
Author:weiw |
Hits:
Description: 约瑟夫问题，这是用VC环境实现的一个数据结构经典问题-Joseph, and this is a VC environment data structure to achieve the classic problem Platform: |
Size: 658432 |
Author:sunkang |
Hits:
Description: 用于解决约瑟夫问题。堆栈方法。约瑟夫问题是个有名的问题：N个人围成一圈，从第一个开始报数，第M个将被杀掉，最后剩下一个，其余人都将被杀掉。例如N=6，M=5，被杀掉的人的序号为5，4，6，2，3。最后剩下1号。 -Joseph used to solve the problem. Stack method. Josephus problem is a well-known problem: N individual circle, starting from the first report number, the first M months will be killed, what is left one, the others will be killed. For example, N = 6, M = 5, number of people being killed as 5,4,6,2,3. The last remaining No. 1. Platform: |
Size: 169984 |
Author:张驰 |
Hits:
Search - Josephus problem